Rudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus
نویسنده
چکیده
This paper continues the investigation of rudimentary Kripke models, i.e. non-quasiordered Kripke-style models for the Heyting propositional calculus H. Three topics, which make three companion pieces of [3], are pursued. The first topic is Beth-style models for H called rudimentary Beth models. Rudimentary Kripke models may be conceived as a particular type of these models, which are analogous to rudimentary Kripke models in not assuming quasi-ordering for the underlying frames. The second topic is a first step into the correspondence theory for rudimentary Kripke models. It is shown what conditions on frames are now defined by the characteristic schemata of Dummett's logic, the logic of weak excluded middle and classical propositional logic. The third topic is a generalization of rudimentary Kripke models that yields models called conditionally rudimentary Kripke models. It is shown that, if we don't want to change the usual semantic clauses for the connectives, conditionally rudimentary Kripke models make the largest class of Kripkestyle models with respect to which we can demonstrate the ordinary soundness and completeness of H.
منابع مشابه
Rudimentary Kripke Models for the Intuitionistic Propositional Calculus
DoSen, K., Rudimentary Kripe models for the intuitionistic propositional calculus, Annals of Pure and Applied Logic 62 (1993) 21-49. It is shown that the intuitionistic propositional calculus is sound and complete with respect to Kripke-style models that are not quasi-ordered. These models, called rudimentary Kripke models, differ from the ordinary intuitionistic Kripke models by making fewer a...
متن کاملAncestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus
This is a sequel to two previous papers, where it was shown that, for the Heyting propositional calculus H, we can give Kripke-style models whose accessibility relation R need not be a quasi-ordering relation, provided we have: x\=A &Vy(xRy=* y VA). From left to right, this is the heredity condition of standard Kripke models for H, but, since R need not be reflexive, the converse is not automat...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملExact and extendible formulas in intuitionistic propositional calculus
It is well-known that any substitution in intuitionistic propositional logic can be seen as an endomorphism between free Heyting algebras. For a given substitution σ : F (n)→ F (m), (where F (n) is the n-generated free Heyting algebra, n ∈ ω), the theory of σ is the filter σ−1(>). The theory of σ is finitely axiomatizable if σ−1(>) is a principal filter. The formula which generates this filter ...
متن کاملNormalisation by Completeness with Heyting Algebras
Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 1 شماره
صفحات -
تاریخ انتشار 1991